#include <iostream>
#include <vector>

using namespace std;
class Solution 
{
public:
    int searchInsert(vector<int>& nums, int target) 
    {
        int left = 0, right = nums.size() - 1;
        int mid = 0;
        while (left < right)
        {
            mid = left + (right - left) / 2;
            if (nums[mid] < target)
            {
                left = mid + 1;
            }
            else
                right = mid;
        }
        if (nums[left] < target)
            return right + 1;
        else
            return right;
    }
};
int main()
{
    vector<int> nums = { 1, 3, 5, 6 };
    int target = 7;
    Solution xz;
    int n = xz.searchInsert(nums, target);
    cout << n << endl;
     
	return 0;
}